|
Title:
|
DATA COMPRESSION USING HUFFMAN CODING A NOVEL APPROACH |
|
Author(s):
|
Md. Rafiul Hassan , Baikunth Nath |
|
ISBN:
|
972-99353-6-X |
|
Editors:
|
Nuno Guimarães and Pedro Isaías |
|
Year:
|
2005 |
|
Edition:
|
2 |
|
Keywords:
|
Huffman coding, data compression, lossless coding, JPEG, block subdividing algorithm. |
|
Type:
|
Short Paper |
|
First Page:
|
143 |
|
Last Page:
|
148 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Lossless compression of a sequence of symbols is important in Information theory as well as todays IT field. Huffman coding is lossless and is most widely used. However, Huffman coding has some limitations depending on the stream of symbols appearing in a file. In fact, Huffman coding generates a code with very few bits for a symbol that has a very high probability of occurrence and a larger number of bits for a symbol with a low probability of occurrence [1]. In this paper, we present a novel technique that subdivides the original symbol sequence into two or more subsequences. We then apply Huffman coding on each of the subsequences. This proposed scheme gives approximately 10-20% better compression in comparison with that of straightforward usage of Huffman coding. |
|
|
|
|
|
|
